dnetwork outlier detect wireless sensor network address problem unsupervis outlier detect wireless sensor network develop algorithm flexibl respect outlier definit work network commun load proport outcom reveal outcom sensor examin algorithm perform simul real sensor data stream result demonstr algorithm accur impos reason commun load level power consumpt gener local algorithm mine data stream larg distribut system abstract larg network comput wireless sensor compon henceforth peer data global state system system function messag rout inform retriev load share reli model global state refer outcom function load experienc peer model system state system constantli chang model date comput global data mine model decis tree mean cluster larg distribut system costli due scale system due commun cost high cost increas dynam scenario data rapidli paper describ step approach deal cost describ highli effici local algorithm monitor wide class data mine model algorithm feedback loop monitor complex function data mean cluster theoret claim corrobor experiment analysi distribut decis dtree induct peer dto dpeer system paper offer scalabl robust distribut algorithm decis tree induct larg peer peer environ comput decis tree larg distribut system standard central algorithm commun expens impract synchron requir problem challeng distribut stream monitor scenario decis tree updat respons data distribut paper present altern solut work complet asynchron manner distribut environ offer low commun overhead necess scalabl seamlessli handl data peer failur paper present extens experiment result corrobor theoret claim index term peer peer data mine decis tree provid danonym data mine local facil locat algorithm larg dscale distribut system abstract facil locat problem flp set facil set client serv facil goal decid subset facil open client serv minim cost paper investig flp set cost depend data peer node set typifi modern distribut system peer peer file share network grid system wireless sensor network perform network organ data placement collect power manag task kind propos local effici algorithm solv flp set algorithm present extrem scalabl decentr requir rout capabl resili failur data execut dnetwork outlier detect wireless sensor network address problem unsupervis outlier detect wireless sensor network develop algorithm flexibl respect outlier definit work network commun load proport outcom reveal outcom sensor examin algorithm perform simul real sensor data stream result demonstr algorithm accur impos reason commun load level power consumpt mine misconfigur machin grid system grid system prove increasingli manag batch comput job organ intel intern develop netbatch system manag ten thousand machin size heterogen complex grid system make difficult configur result misconfigur machin advers affect entir system investig distribut data mine approach detect misconfigur machin grid monitor system gm intrus collect data sourc log file system servic grid system convert raw data semant meaning data store data machin obtain limit incur overhead allow scalabl analysi request distribut outlier detect algorithm emploi identifi misconfigur machin algorithm implement recurs workflow grid job suit grid system machin unavail time fail altogeth danonym decis tree induct paper explor approach privaci preserv data mine reli anonym model anonym model guarante privat inform tabl link group individu suggest extend definit anonym anonym data mine model determin definit present decis tree induct algorithm guarante maintain anonym learn exampl experi show embed anonym decis tree induct process accuraci anonym data induc tree local dthreshold base data mine peer dto dpeer system larg network comput wireless sensor mobil devic compon peer data global statu system function system rout decis search strategi data cleans assign mutual trust depend global statu essenti system detect react global statu comput global predic system costli scale case sensor network high cost commun cost increas data rapidli due state node failur comput follow paper describ step approach deal cost describ highli effici local algorithm detect norm averag data surpass threshold algorithm feedback loop monitor complex predic data data mean cluster effici algorithm guarante long cluster result repres data data stationari resourc requir data undergo epoch chang chang underli distribut model longer repres feedback loop model rebuilt exist feedback loop approxim effort method construct model ill fit model built feedback loop model rebuilt distribut data mine peer dto dpeer network distribut data mine deal problem data analysi environ distribut data comput node user peer peer comput emerg distribut comput paradigm applic involv exchang inform larg number peer central coordin file share electron commerc monitor base network sensor exampl paper offer overview distribut data mine applic algorithm environ describ exact approxim distribut data mine algorithm work decentr manner local facil locat algorithm sensor network abstract paper address facil locat problem flp sensor network environ problem deal find optim provid servic possibl larg number client show variat problem solv local algorithm local algorithm extrem sensor network scenario commun rang sensor restrict minimum oper routerless network complex problem solv basi inform gather nearbi sensor local facil locat algorithm describ asynchron seamlessli support failur data calcul pose modest memori comput requir provid anytim solut guarante converg exact comput central algorithm entir data hierarch decis tree induct distribut genom databas abstract classif base decis tree import problem data mine applic field recent year databas system highli distribut distribut system paradigm feder peer peer databas adopt paper problem induc decis tree larg distribut network genom databas work motiv exist distribut databas healthcar bioinformat vision databas larg amount genom data character high dimension current decis tree algorithm requir high commun bandwidth execut data exist larg scale distribut system present algorithm sharpli reduc commun overhead send fraction statist data fraction suffici deriv exact decis tree learn sequenti learner data network extens experi standard synthet snp data show algorithm util high depend attribut typic genom data reduc commun overhead scalabl test show algorithm scale size dataset number snp size distribut system decis tree induct high dimension hierarch decis tree induct distribut genom databas abstract classif base decis tree import problem data mine applic field recent year databas system highli distribut distribut system paradigm feder peer peer databas adopt paper problem induc decis tree larg distribut network genom databas work motiv exist distribut databas healthcar bioinformat vision databas larg amount genom data character high dimension current decis tree algorithm requir high commun bandwidth execut data exist larg scale distribut system present algorithm sharpli reduc commun overhead send fraction statist data fraction suffici deriv exact decis tree learn sequenti learner data network extens experi standard synthet snp data show algorithm util high depend attribut typic genom data reduc commun overhead scalabl test show algorithm scale size dataset number snp size distribut system high dperform distribut algorithm mine associ rule privaci dpreserv associ rule mine larg dscale distribut system data privaci major concern threaten widespread deploy data grid domain health care financ propos uniqu approach obtain knowledg data mine model data grid ensur data cryptograph safe made innov natur gener accept trust parti model privaci preserv data mine algorithm suitabl grid scale system algorithm asynchron involv global commun pattern dynam adjust data failur recoveri resourc knowledg privaci preserv mine algorithm possess featur simul thousand resourc prove algorithm quickli converg correct result reason commun simul prove effect privaci paramet converg time number messag logarithm local algorithm ad hoc major vote charg fusion abstract present local distribut algorithm gener major vote problem timevari vote power vote split arbitrari dynam interconnect topolog link delai fix major threshold algorithm combin effici anytim span forest algorithm applic charg fusion algorithm root tree node excess charg deriv node vote power vote split subsequ transfer charg tree link opposit charg root fusion instant node ad hoc belief outcom ceas correct major decis reach node time case independ graph size algorithm correct salient properti prove experi million node provid valid actual number knowledg local sensit solut major vote problem arbitrari dynam chang commun graph background privaci dpreserv data mine data grid presenc malici particip commun deffici distribut mine associ rule high dperform distribut algorithm mine associ rule associ rule mine peer dto dpeer system extend problem associ rule mine kei data mine problem system databas partit larg number comput dispers wide area comput system includ grid comput platform feder databas system peer peer comput environ scale system pose difficulti impract global commun global synchron dynam topolog network fly data updat share resourc applic frequent failur recoveri resourc commun effici distribut mine associ rule 